A secure approach to election scheme based on Naccache Stern Knapsack Cryptosystem
نویسندگان
چکیده
Election is a fundamental mechanism of democracy for people to elect a Government of their choice. Electronic voting is an emerging technology that guarantees privacy, security, correctness, verifiability and robustness. Recently, many researchers have proposed the improvements of efficient schemes on the electronic voting to ensure the security and privacy of voters. However, there is no scheme to solve the security and privacy problem of the electronic voting machine completely. We propose a new voting machine that utilizes Naccache Stern Knapsack Cryptosystem to enhance more security. Development of a secure electronic voting system based on our proposed software, enhanced the security and privacy for the voters.
منابع مشابه
Exploring Naccache-Stern Knapsack Encryption
The Naccache–Stern public-key cryptosystem (NS) relies on the conjectured hardness of the modular multiplicative knapsack problem: Given p, {vi}, ∏ vi i mod p, find the {mi}. Given this scheme’s algebraic structure it is interesting to systematically explore its variants and generalizations. In particular it might be useful to enhance NS with features such as semantic security, re-randomizabili...
متن کاملLinear Bandwidth Naccache-Stern Encryption
The Naccache-Stern (ns) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying public-keys indexed by the message bits modulo a prime p. The cleartext is recovered by factoring the ciphertext raised to a secret power modulo p. ns encryption requires a multiplication per two plaintext bits on the average. Decr...
متن کاملA New Knapsack Public-Key Cryptosystem Based on Permutation Combination Algorithm
A new secure knapsack cryptosystem based on the Merkle-Hellman public key cryptosystem will be proposed in this paper. Although it is common sense that when the density is low, the knapsack cryptosystem turns vulnerable to the low-density attack. The density d of a secure knapsack cryptosystem must be larger than 0 9408 . to avoid low-density attack. In this paper, we investigate a new Permutat...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملMerkle-Hellman Revisited: A Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations
Cryptosystems based on the knapsack problem were among the rst public key systems to be invented and for a while were considered quite promising. Basically all knapsack cryptosystems that have been proposed so far have been broken, mainly by means of lattice reduction techniques. However, a few knapsack-like cryptosystems have withstood cryptanalysis, among which the Chor-Rivest scheme 2] even ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010